On the discrete logarithm in the divisor class group of curves

نویسنده

  • Hans-Georg Rück
چکیده

Let X be a curve which is defined over a finite field k of characteristic p. We show that one can evaluate the discrete logarithm in Pic0(X)pn by O(n2 log p) operations in k. This generalizes a result of Semaev for elliptic curves to curves of arbitrary genus. Let k be a finite field of characteristic p. We consider a projective irreducible nonsingular curve X of genus g ≥ 1 which is defined over k. We assume that the curve X has a k-rational point P0. Let Pic0(X)m be the subgroup of the m-torsion points in the group of divisor classes of degree 0 on X . In [1] it is shown that one can reduce the evaluation of the discrete logarithm in Pic0(X)m by O(log m) operations to the evaluation of the discrete logarithm in k(ζm)∗, where ζm is a primitive m-th root of unity, if the integer m is prime to p. If m = p and if the curve X is an elliptic curve (i.e., g = 1), then it is proved in [2] that the discrete logarithm in Pic0(X)p can be evaluated by O(log p) operations in k. We want to extend this result to curves X of arbitrary genus g, and we will see that its proof is based on the connection between Pic0(X)p and logarithmic holomorphic differentials on X . Theorem. The discrete logarithm in Pic0(X)pn can be evaluated by O(n log p) operations in k. Proof. Let x ∈ Pic0(X)pn be an element of order p and let y be contained in the cyclic group generated by x. We have to show that λ ∈ Z/pZ with y = λ · x can be evaluated by O(n log p) operations. It is a standard argument to reduce the evaluation of λ = ∑n−1 i=0 λip i with 0 ≤ λi < p to the evaluation of λi (by multiplication with p, 0 ≤ i ≤ n − 1) as solutions of n discrete logarithms in Pic0(X)p. Hence we can assume that n = 1. The key point of the proof is the following result of Serre ([3], Proposition 10). Let Ω(X) be the k-vector space of holomorphic differentials on X . Then there is an isomorphism from Pic0(X)p into Ω(X) given by the following rule: Choose a divisor D of degree 0 with p ·D = (f), where f is a function on X , then the divisor class D ∈ Pic0(X)p is mapped to the holomorphic differential df/f . Received by the editor August 8, 1997. 1991 Mathematics Subject Classification. Primary 11T71; Secondary 94A60. c ©1999 American Mathematical Society

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves

Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...

متن کامل

Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm

The discrete logarithm is an important crypto primitive for public key cryptography. The main source for suitable groups are divisor class groups of carefully chosen curves over finite fields. Because of index-calculus algorithms one has to avoid curves of genus ≥ 4 and non-hyperelliptic curves of genus 3. An important observation of Smith [S] is that for “many” hyperelliptic curves of genus 3 ...

متن کامل

Arithmetic on superelliptic curves

superelliptic curves, jacobians, cryptography, discrete logarithm problem In this paper we present an efficient, polynomial-time method to perform calculations in the divisor class group of a curve which has a single point on its normalization above infinity. In particular, we provide a unique representation of divisor classes and an algorithm for reducing a divisor on such a curve to its corre...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Empirical optimization of divisor arithmetic on hyperelliptic curves over F2m

A significant amount of effort has been devoted to improving divisor arithmetic on low-genus hyperelliptic curves via explicit versions of generic algorithms. Moderate and high genus curves also arise in cryptographic applications, for example, via the Weil descent attack on the elliptic curve discrete logarithm problem, but for these curves, the generic algorithms are to date the most efficien...

متن کامل

On the discrete logarithm problem in class groups of curves

We study the discrete logarithm problem in degree 0 class groups of curves over finite fields, with particular emphasis on curves of small genus. We prove that for every fixed g ≥ 2, the discrete logarithm problem in degree 0 class groups of curves of genus g can be solved in an expected time of Õ(q 2 g ), where Fq is the ground field. This result generalizes a corresponding result for hyperell...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Comput.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 1999